Vertex Separators for Partitioning a Graph
نویسنده
چکیده
Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputational power arising in such applications to simulate physical phenomenoncorrectly mandates the use of massively parallel computers to distribute the workloadevenly. In this study, a novel heuristic algorithm called Line Graph Bisection whichpartitions a graph via vertex separators so as to balance the workload amongst theprocessors and to minimize the communication overhead is proposed. The proposedalgorithm is proved to be computationally feasible and makes cost-effective parallelimplementations possible to speed up the solution process.
منابع مشابه
Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
In this whitepaper, we describe the problem of permuting sparse square matrices into block diagonal form with overlap (BDO) and propose a graph partitioning algorithm for solving this problem. A block diagonal matrix with overlap is a block diagonal matrix whose consecutive diagonal blocks may overlap. The objective in this permutation problem is to minimize the total overlap size, whereas the ...
متن کاملoGPVS/BDO: A Software Package for Ordered Graph Partitioning by Vertex Separators and Permuting Matrices into Block Diagonal Form with Overlap
متن کامل
Graph Partitioning Algorithms with Applications to Scientific Computing Graph Partitioning Algorithms
Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a speciied number of subsets such that few edges join two vertices in diierent subsets. Several new graph partitioning al...
متن کاملPartitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inheren...
متن کاملPartitioning Multivariate Polynomial Equations via Vertex Separators for Algebraic Cryptanalysis and Mathematical Applications
We present a novel approach for solving systems of polynomialequations via graph partitioning. The concept of a variable-sharing graph of asystem of polynomial equations is defined. If such graph is disconnected, thenthe system of equations is actually two separate systems that can be solvedindividually. This can provide a significant speed-up in computing the solutionto the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 8 شماره
صفحات -
تاریخ انتشار 2008